Patrice Quinton , Sanjay Rajopadhye , Tanguy Risset
نویسندگان
چکیده
We address the problem of computation upon Z Z-polyhedra which are intersections of polyhedra and integral lattices. We introduce a canonic representation for Z Z-polyhedra which allow to perform comparisons and transformations of Z Z-polyhedra with the help of a computational kernel on polyhedra. This contribution is a step toward the manipulation of images of polyhedra by aane functions, and has application in the domain of automatic parallelization and parallel vlsi synthesis. Manipulations de Z-poly edres R esum e : Nous nous int eressons au probl eme du calcul sur les Z Z-poly edres (intersections entre des poly edres et des treillis entiers). Nous introduisons une repr esentation canonique pour les Z Z-poly edres qui permet, avec l'aide d'un outils de calcul sur les poly edres, d'eeectuer des comparaisons et des transformations sur les Z Z-poly edres. Cette contribution est un pas vers la manipulation d'images de poly edres par des fonctions aanes. Les r esultats pr esent es ici ont des applications dans le domaine de la parall elisation automatique et la synth ese d'architecture vlsi parall eles
منابع مشابه
Extension Of The Alpha Language To Recurrences On Sparse Periodic Domains
Alpha is a functional language based on systems of aane recurrence equations over polyhedral domains. We present an extension of Alpha to deal with sparse polyhedral domains. Such domains are modeled by Z-polyhedra, namely the intersection of lattices and polyhedra. We summarize the mathematical closure properties of Z-polyhedra, and we show how the important features of Alpha, namely normaliza...
متن کاملGenerating Regular Arithmetic Circuits with AlpHard
The eecient vlsi implementation of arithmetics operators requires that design be optimized, both by looking for eecient algorithms, and by producing compact regular layouts. We present AlpHard, a subset of Alpha { a language for the synthesis of regular algorithms. AlpHard is intended for specifying the Register Transfer Level (RTL) representation of an architecture, in such a way that any regu...
متن کاملA reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems
We address the problem of optimally mapping uniform DAGs to systolic arrays, given an affine timing function. We introduce an automatic allocation method based on a preprocessing by reindexing that transforms the initial DAG into a new one that enables the well known projection method to minimize the number of processors along a number of directions. We demonstrate its superiority to other meth...
متن کاملHardware Synthesis for Multi-Dimensional Time
This paper introduces basic principles for extending the classical systolic synthesis methodology to multi-dimensional time. Multi-dimensional scheduling enables complex algorithms that do not admit linear schedules to be parallelized, but it also implies the use of memories in the architecture. The paper explains how to obtain compatible allocation and memory functions for vlsi (or simd-like c...
متن کاملStructuration of the Alpha language
This paper presents extensions to Alpha, a language based upon the formalism of affine recurrence equations (AREs). These extensions address the need for parametric and structured systems of such AREs. Similar to, but more general as the map operator of classical functional languages, the Alpha structuration techniques provide a dense and powerful description of complex systems referencing each...
متن کامل